Interference Automata

We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of optical interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis and J. Watrous, Two-way Finite Automata With Quantum and Classical States, Theoretical Computer Science, 287 (1), 299-311, (2002)] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Finally we show the existence of a language that cannot be recognized by a 2OIA but can be recognized by an $O(n^3)$ space Turing machine.Comment: 19 pages. A preliminary version appears under the title "On a Model of Computation based on Optical Interference" in Proc. of the 16-th Australasian Workshop on Combinatorial Algorithms (AWOCA'05), pp. 249-26

Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic unordered search of van Dam et al. (How powerful is adiabatic quantum computation? Proc. IEEE FOCS, pp. 279-287, 2001) and Roland and Cerf (Physical Review A 65, 042308, 2002) when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in $\log N$, where $N$ is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.Comment: 11 page

Organization Development Experiences . A Case for Enriching HRD through OD

This article reviews a few definitions of OD and identifies eight characters that are necessary to call an activity or experience as an OD activity or experience. The article then goes on to examine ten case studies (of research, consulting and OD) of what appears like an OD activity in which the author was involved as one of the facilitators for whole system or subsystem and examines each on of them for their appropriateness to be called as OD interventions. The author then goes on to derive some lessons from these experiences. The article outlines also some advantages of using traditional OD approach in various HRD interventions and offers some suggestions for making specific HRD interventions like competency mapping, 360Degree Feedback based leadership Development and Assessment and Development Centers as OD activities. The paper concludes that using an OD approach enriches HRD and yields a good ROI on HRD interventions.

Automatic Clustering with Single Optimal Solution

Determining optimal number of clusters in a dataset is a challenging task. Though some methods are available, there is no algorithm that produces unique clustering solution. The paper proposes an Automatic Merging for Single Optimal Solution (AMSOS) which aims to generate unique and nearly optimal clusters for the given datasets automatically. The AMSOS is iteratively merges the closest clusters automatically by validating with cluster validity measure to find single and nearly optimal clusters for the given data set. Experiments on both synthetic and real data have proved that the proposed algorithm finds single and nearly optimal clustering structure in terms of number of clusters, compactness and separation.Comment: 13 pages,4 Tables, 3 figure

Lam'e Instantons

We perform a precise analytic test of the instanton approximation by comparing the exact band spectrum of the periodic Lam\'e potential to the tight-binding, instanton and WKB approximations. The instanton result gives the correct leading behavior in the semiclassical limit, while the tight-binding approximation does even better. WKB is off by an overall factor of $\sqrt{e/\pi}$.Comment: 4 pp, RevTeX, 4 figs, uses epsfig.sty; references adde